The Robbins problem: computer proofs and human proofs
نویسندگان
چکیده
منابع مشابه
Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand
In one of Krylov’s fables, a small dog Moska barks at the elephant who pays no attention whatsoever to Moska. This image comes to my mind when I think of constructive mathematics versus “classical” (that is mainstream) mathematics. In this article, we put a few words into the elephant’s mouth. The idea to write such an article came to me in the summer of 1995 when I came across a fascinating 19...
متن کاملComputer-Aided Cryptographic Proofs
EasyCrypt is an automated tool that supports the machinechecked construction and verification of security proofs of cryptographic systems, and that has been used to verify emblematic examples of publickey encryption schemes, digital signature schemes, hash function designs, and block cipher modes of operation. The purpose of this paper is to motivate the role of computer-aided proofs in the bro...
متن کاملComputer-Assisted Simulation Proofs
This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I/O automata to extract a set of proof obligations for showing that the behaviors of one algorithm are among those of another, and it uses the Larch tools for speci cation and deduction to discharge these obligations in a natural and easy-to-read fashion. The approach is demonstrate...
متن کاملStructuring Computer Generated Proofs
One of the main disadvantages of computer generated proofs of mathematical theorems is their complexity and incomprehensibility. Proof transformation proce- dures have been designed in order to state these proofs in a formalism that is more familiar to a human ma- thematician. But usually the essential idea of a proof is still not easily visible. We describe a procedure to transform proofs re...
متن کاملThe Problem of Validity Proofs
In philosophical contexts, logical formalisms are often resorted to as a means to render the validity and invalidity of informal arguments formally transparent. Since Oliver (1967) and Massey (1975), however, it has been recognized in the literature that identifying valid arguments is easier than identifying invalid ones. Still, any viable theory of adequate logical formalization should at leas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetes
سال: 2001
ISSN: 0368-492X
DOI: 10.1108/eum0000000005698